Guarding a set of line segments in the plane
نویسندگان
چکیده
منابع مشابه
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space ...
متن کاملElementary Partitions of Line Segments in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called elementary partitions of S. The set of faces of such a partition is a maximal set of disjoint triangles that cut S at, and only at, their vertices. Surprisingly, several properties of point set triangulations extend to elementary partitions. Thus, the number of their faces is an i...
متن کاملβ-skeletons for a Set of Line Segments in R2
We generalize β-skeletons, well-known neighborhood graphs for point sets, to sets of line segments and present algorithms for computing such skeletons, both circle and lens-based, for the entire range of β values. In particular, for β ≥ 1 the β-skeleton for a set S on n segments in the Euclidean plane can be constructed in O(nα(n) log n) time and the construction relies on the Delaunay triangul...
متن کاملa swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولEvery Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.014